Star edge-coloring of subcubic graphs
Martina Mockovčiaková

Abstract
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and bichromatic cycles of length four. In 2013 Dvorak, Mohar, and Samal showed that 7 colors are enough for a star edge-coloring of subcubic graphs. They suggested to study a list version of this problem and asked whether 7 colors are enough also for list star edge-coloring of subcubic graphs. In this talk, we discuss known results on star edge-coloring, focus the attention to subcubic graphs and prove that the list star chromatic index of such graphs is at most 7, answering the question above.